Extended Schemes for Visual Cryptography
نویسندگان
چکیده
An extended visual cryptography scheme, (? Qual ; ? Forb ; m)-EVCS for short, with pixel \expansion" m, for an access structure (? Qual ; ? Forb) on a set of n participants, is a technique to encode n innocent looking images in such a way that when we stack together the transparencies associated to participants in any set X 2 ? Qual we get the secret message with no trace of the original images, but any X 2 ? Forb has no information on the shared image. Moreover, after the original innocent looking images are encoded they are still meaningful, that is, any user will recognize the image on his transparency. In this paper we rst present a general technique to implement extended visual cryptography schemes, which uses hypergraph colourings. Then we discuss some applications of this technique to various interesting classes of access structures by using relevant results from the theory of hypergraph colourings.
منابع مشابه
On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملExtended visual cryptography systems
Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image to each member of a group P of n persons. Whereas most work in recent years has been done concerning the problem of qualified and forbidden subsets of P or the question of contrast optimizing, in this paper we study e...
متن کاملVisual Cryptography Schemes: A Comprehensive Survey
ryptography is study of transforming information in order to make it secure from unintended recipients. Visual Cryptography Scheme (VCS) is a cryptography method that encrypts any information [picture, printed text, etc] such that decryption can be performed using human visual system. The goal of this survey paper is to give the readers an overview of the basic visual cryptography schemes const...
متن کاملمطالعهای بر رمزنگاری بصری و ارائهی روش پیشنهادی برای رمزنگاری تصاویر رنگی
Visual cryptography is a method that makes use of the characteristics of human vision and it requires neither the knowledge of cryptography nor the complex calculations. This method was first proposed by Naor and Shamir, its implementation is simple, it has been extended to an secrect sharing (k, n) in which n shares are made from the image and they are distributed among n participants. Moreov...
متن کامل